Semifolding 2 Designs

نویسندگان

  • Robert W. Mee
  • Marta Peralta
چکیده

This article addresses the varied possibilities for following a two-level fractional factorial with another fractional factorial half the size of the original experiment. While follow-up fractions of the same size as an original experiment are common practice, in many situations a smaller follow-up experiment will suffice. Peter John coined the term “semifolding” to describe using half of a foldover design. Existing literature does include brief mention and examples of semifolding but no thorough development of this followup strategy. After a quick examination of the estimation details for semifolding the 1 IV 2 design, we focus on following 16-run fractions with a semifold design of eight runs. Two such examples are considered one where the initial fraction is resolution IV, the other resolution III. A general result is proven for semifolding p k − IV 2 designs. Conducting full foldover designs in two blocks is also recommended.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Semifoldover Plans for Two-Level Orthogonal Designs

Foldover is a widely used procedure for selecting follow-up experimental runs. As foldover designs require twice as many runs as the initial design, they can be inefficient if the number of effects to be dealiased is smaller than the size of the original experiment. Semifolding refers to adding half of a foldover fraction and is a technique that has been investigated in recent literature for re...

متن کامل

On Minimal Defining Sets of Full Designs and Self-Complementary Designs, and a New Algorithm for Finding Defining Sets of t-Designs

A defining set of a t-(v, k, λ) design is a partial design which is contained in a unique t-design with the given parameters. A minimal defining set is a defining set, none of whose proper partial designs is a defining set. This paper proposes a new and more efficient algorithm that finds all non-isomorphic minimal defining sets of a given t-design. The complete list of minimal defining sets of...

متن کامل

Some New Steiner 2-Designs S(2, 4, 37)

Automorphisms of Steiner 2-designs S(2, 4, 37) are studied and used to find many new examples. Some of the constructed designs have S(2, 3, 9) subdesigns, closing the last gap in the embedding spectrum of S(2, 3, 9) designs into S(2, 4, v) designs.

متن کامل

Doubles of Hadamard 2-(15,7,3) designs

Nonisomorphic 2-(15,7,6) designs which are doubles of Hadamard 2(15,7,3) designs are constructed. The automorphism groups of the Hadamard designs are considered to reduce the number of isomorphic ones among the constructed doubles. Canonical form of the incidence matrices is used to reject isomorphic designs and to establish the order of their automorphism groups. There are 5 non isomorphic 2-(...

متن کامل

Block Transitive Resolutions of t - designs andRoom

By a resolution of t-designs we mean a partition of the trivial design ? X k of all k-subsets of a v-set X into t ? (v 0 ; k;) designs, where v 0 v. A resolution of t-designs with v = v 0 is also called a large set of t-designs. A Room rectangle R, based on ? X k , is a rectangular array whose non-empty entries are k-sets. This array has the further property that taken together the rows form a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999